Dual filtered backprojection for micro-rotation confocal microscopy

نویسندگان

  • Danai Laksameethanasan
  • Sami S. Brandt
  • Olivier Renaud
  • Spencer L. Shorte
  • Sami S Brandt
  • Spencer L Shorte
چکیده

Micro-rotation confocal microscopy is a novel optical imaging technique which employs dielectric fields to trap and rotate individual cells to facilitate 3D fluorescence imaging using a confocal microscope. In contrast to computed tomography (CT) where an image can be modelled as parallel projection of an object, the ideal confocal image is recorded as a central slice of the object corresponding to the focal plane. In CT, the projection images and the 3D object are related by the Fourier slice theorem which states that the Fourier transform of a CT image is equal to the central slice of the Fourier transform of the 3D object. In the micro-rotation application, we have a dual form of this setting, i.e. the Fourier transform of the confocal image equals the parallel projection of the Fourier transform of the 3D object. Based on the observed duality, we present here the dual of the classical filtered back projection (FBP) algorithm and apply it in micro-rotation confocal imaging. Our experiments on real data demonstrate that the proposed method is a fast and reliable algorithm for the micro-rotation application, as FBP is for CT application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the optimality of the filtered backprojection algorithm.

It is shown that under certain conditions the filtered backprojection algorithm produces a computed tomographic reconstruction for which the statistical accuracy attainable in the amplitude estimation of large-area objects meets the general lower bound derived by Tretiak. In this sense, filtered backprojection is an optimum algorithm.

متن کامل

Tomographic reconstruction from limited data

Introduction At present, image reconstruction in micro-CT imaging is typically performed using the FDK algorithm. This algorithm, which is similar to the Filtered Backprojection algorithm for singleslice tomography, is capable of computing accurate reconstructions in a relatively short time, provided that the acquired dataset satisfies certain requirements: (i) a large number of projection imag...

متن کامل

A pointwise limit theorem for filtered backprojection in computed tomography.

Computed tomography (CT) is one of the most important areas in the modern science and technology. The most popular approach for image reconstruction is filtered backprojection. It is essential to understand the limit behavior of the filtered backprojection algorithms. The classic results on the limit of image reconstruction are typically done in the norm sense. In this paper, we use the method ...

متن کامل

Inversion of spherical means using geometric inversion and Radon transforms

We consider the problem of reconstmcting a continuous function on R" from certain values of its spherical means. A novel aspect of our approach is the use of geometric inversion to recast the inverse spherical mean problem as an inverse Radon transform problem. W define WO spherical mean inverse problems the entire problem and the causal problem. We then present a dual filtered backprojection a...

متن کامل

Katsevich-Type Algorithms for Variable Radius Spiral Cone-Beam CT

To solve the long object problem, an exact and efficient algorithm has been recently developed by Katsevich. While the Katsevich algorithm only works with standard helical cone-beam scanning, there is an important need for nonstandard spiral cone-beam scanning. Specifically, we need a scanning spiral of variable radius for our newly proposed electron-beam CT/micro-CT prototype. In this paper, f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008